Non-deterministic Queue Operations
نویسندگان
چکیده
منابع مشابه
Deterministic Operations Research Some Examples
A summary of deterministic operations research models in linear programming, inventory theory, and dynamic programming. 1 Linear Programming A mathematical model of the problem is developed basically by applying a scientific approach as described earlier. There are a number of activities to be performed and each unit of each activity consumes some amount of each type of a resource. Resources ar...
متن کاملMinimizing queue variance using randomized deterministic marking
Recent work on congestion control in TCP/IP networks combines improved end-user transmission mechanisms with active queue management schemes at network routers. An active queue management scheme consists of two stages. In order to stabilize the queues at a router, one must first determine an appropriate packet marking probability given the current degree of congestion. Second, in order to reali...
متن کاملPriority Queue Operations on EREW-PRAM
Using EREW-PRAM algorithms on a tournament based complete binary tree we implement the insert and extract-min operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions 4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both operations. We also improve on constant factors the asymptotic bound for extract-min since in it we...
متن کاملParallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREW-PRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue of n elements can be performed in O(l...
متن کاملDeterministic Execution of Java's Primitive Bytecode Operations
For the application of Java in realtime and safety critical domains, an analysis of the worst-case execution times of primitive Java operations is necessary. All primitive operations must either execute in constant time or have a reasonable upper bound for their execution time. The difficulties that arise for a Java virtual machine and a Java compiler in this context will be presented here. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1062